Vector Spaces of Linearizations for Matrix Polynomials: A Bivariate Polynomial Approach
نویسندگان
چکیده
Abstract. We revisit the important paper [D. S. Mackey, N. Mackey, C. Mehl, and V. Mehrmann, SIAM J. Matrix Anal. Appl., 28 (2006), pp. 971–1004] and, by viewing matrices as coefficients for bivariate polynomials, we provide concise proofs for key properties of linearizations for matrix polynomials. We also show that every pencil in the double ansatz space is intrinsically connected to a Bézout matrix, which we use to prove the eigenvalue exclusion theorem. In addition our exposition allows for any degree-graded basis, the monomials being a special case. Matlab code is given to construct the pencils in the double ansatz space for matrix polynomials expressed in any orthogonal basis.
منابع مشابه
Vector Spaces of Linearizations for Matrix Polynomials
The classical approach to investigating polynomial eigenvalue problems is linearization, where the polynomial is converted into a larger matrix pencil with the same eigenvalues. For any polynomial there are infinitely many linearizations with widely varying properties, but in practice the companion forms are typically used. However, these companion forms are not always entirely satisfactory, an...
متن کاملLarge Vector Spaces of Block-symmetric Strong Linearizations of Matrix Polynomials
M. I. BUENO∗, F. M. DOPICO †, S. FURTADO ‡, AND M. RYCHNOVSKY § Abstract. Given a matrix polynomial P (λ) = Pk i=0 λ Ai of degree k, where Ai are n × n matrices with entries in a field F, the development of linearizations of P (λ) that preserve whatever structure P (λ) might posses has been a very active area of research in the last decade. Most of the structure-preserving linearizations of P (...
متن کاملEla Linearizations of Singular Matrix Polynomials and the Recovery of Minimal Indices∗
A standard way of dealing with a regular matrix polynomial P (λ) is to convert it into an equivalent matrix pencil – a process known as linearization. Two vector spaces of pencils L1(P ) and L2(P ) that generalize the first and second companion forms have recently been introduced by Mackey, Mackey, Mehl and Mehrmann. Almost all of these pencils are linearizations for P (λ) when P is regular. Th...
متن کاملLinearization of Lagrange and Hermite interpolating matrix polynomials
This paper considers interpolating matrix polynomials P (λ) in Lagrange and Hermite bases. A classical approach to investigate the polynomial eigenvalue problem P (λ)x = 0 is linearization, by which the polynomial is converted into a larger matrix pencil with the same eigenvalues. Since the current linearizations of degree n Lagrange polynomials consist of matrix pencils with n + 2 blocks, they...
متن کاملOn the Sign Characteristic of Hermitian Linearizations in Dl(p )
The computation of eigenvalues and eigenvectors of matrix polynomials is an important, but di cult, problem. The standard approach to solve this problem is to use linearizations, which are matrix polynomials of degree 1 that share the eigenvalues of P ( ). Hermitian matrix polynomials and their real eigenvalues are of particular interest in applications. Attached to these eigenvalues is a set o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 38 شماره
صفحات -
تاریخ انتشار 2017